/*
 * p11292.cpp
 *
 *  Created on: 2013-4-9
 *      Author: zy
 */

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn = 20000 + 5;
int A[maxn], B[maxn];
int main()
{
	int n, m;
	while (scanf("%d%d", &n, &m) && n && m)
	{
		for (int i = 1; i <= n; i++)
			scanf("%d", &A[i]);
		for (int i = 1; i <= m; i++)
			scanf("%d", &B[i]);
		sort(A + 1, A + 1 + n);
		sort(B + 1, B + 1 + m);
		int cur = 0, cost = 0;
		for (int i = 1; i <= m; i++)
			if (B[i] >= A[cur+1])
			{
				cur++;
				cost += B[i];
				if (cur == n) break;
			}
		if (cur < n)
			printf("Loowater is doomed!\n");
		else
			printf("%d\n", cost);
	}
	return 0;
}
